IEEE International Conference on Computer - Aided Design , pp . 546 - 549 , November 1991 Methods for Reducing Events in Sequential Circuit
نویسندگان
چکیده
Methods for Reducing Events in Sequential Circuit Fault Simulation Elizabeth M. Rudnick Thomas M. Niermann Janak H. Patel Center for Reliable and Sunrise Test Systems Inc. Center for Reliable and High-Performance Computing Sunnyvale, CA 94086 High-Performance Computing University of Illinois University of Illinois Urbana, IL 61801 Urbana, IL 61801 Abstract Methods are investigated for reducing events in sequential circuit fault simulation by reducing the number of faults simulated for each test vector. Inactive faults, which are guaranteed to have no e ect on the output or the next state, are identi ed using local information from the fault-free circuit in one technique. In a second technique, the StarAlgorithm is extended to handle sequential circuits and provide global information about inactive faults, based on the fault-free circuit state. Both techniques are integrated into the PROOFS synchronous sequential circuit fault simulator. An average 28% reduction in faulty circuit gate evaluations is obtained for the 19 ISCAS-89 benchmark circuits studied using the rst technique, and 33% reduction for the two techniques combined. Execution times decrease by an average of 17% when the rst technique is used. For the largest circuits, further improvements in execution time are made when the Star-Algorithm is included.
منابع مشابه
2 The MIT Vision Chip Project : Analog VLSI Systems for Fast Image Acquisition and Early Vision Processing Sponsors
ion," in IEEE Trans. Comput.-Aided Des. 7: 713 (June 1988); A. Ghosh, S. Devadas, and A.R. Newton, "Verification of Interacting Sequential Circuits," paper presented at the 27th Design Automation Conference, Orlando, Florida, June 1990, pp. 213-219. 15 M.C. McFarland and A.C. Parker, "An Abstract Model of Behavior for Hardware Descriptions," in IEEE Trans. Comput. C-32:621 (1983). 16 S. Devadas...
متن کاملA powerful global router: based on Steiner min-max trees
We study global routing of multiterminal nets. We propose a new global router; each step consists of finding a tree, called Steiner min-max tree, that is, a Steiner tree with maximum-weight edge minimized (real vertices represent channels containing terminals of a net, Steiner vertices represent intermediate channels, and weights correspond to densities). We propose an effient algorithm for obt...
متن کاملFirst CADathlon Programming Contest held at 2002 ICCAD
104 0740-7475/03/$17.00 © 2003 IEEE Copublished by the IEEE CS and the IEEE CASS IEEE Design & Test of Computers IN THE SPIRIT OF the long-running ACM programming contest, the Special Interest Group on Design Automation (SIGDA) organized an EDA programming contest, the CADathlon. SIGDA held the CADathlon on 10 November 2002, at the Double Tree Hotel in San Jose, Calif., as part of the Sunday pr...
متن کاملMultiple block structure-preserving reduced order modeling of interconnect circuits
In this paper, we propose a generalized multiple-block structure-preserving reduced order interconnect macromodeling method (BSPRIM). Our approach extends the structure-preserving model order reduction (MOR) method SPRIM [R.W. Freund, SPRIM: structure-preserving reduced-order interconnect macromodeling, in: Proceedings of International Conference on Computer Aided Design (ICCAD), 2004, pp. 80–8...
متن کاملGuest Editors' Introduction: Special Section on Emerging Memory Technologies in Very Large Scale Computing and Storage Systems
THE overwhelmingly increasing demand for both storage and computation necessitates revisiting the traditional memory subsystems used in processors and storage systems to take advantage of emerging memory technologies. Dynamic Random Access Memory (DRAM) and Static Random Access Memory (SRAM) have been ubiquitously used for decades as main memory and as on-chip cache, respectively. Scaling and p...
متن کامل